An Efficient Algorithm for Euclidian 2-Center with Outliers∗
نویسندگان
چکیده
For a set P of n points in R, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P . We extend this to the (2, k)-center problem where we compute the minimal radius pair of congruent disks to cover n − k points of P . We present a randomized algorithm with O(nk log n) expected running time for the (2, k)-center problem. We also study the (p, k)-center problem in R under the `∞-metric. We give solutions for p = 4 in O(kn log n) time and for p = 5 in O(kn log n) time.
منابع مشابه
DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM
Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...
متن کاملIdentification of outliers types in multivariate time series using genetic algorithm
Multivariate time series data, often, modeled using vector autoregressive moving average (VARMA) model. But presence of outliers can violates the stationary assumption and may lead to wrong modeling, biased estimation of parameters and inaccurate prediction. Thus, detection of these points and how to deal properly with them, especially in relation to modeling and parameter estimation of VARMA m...
متن کاملImproved MapReduce and Streaming Algorithms for k-Center Clustering (with Outliers)
We present efficient MapReduce and Streaming algorithms for the $k$-center problem with and without outliers. Our algorithms exhibit an approximation factor which is arbitrarily close to the best possible, given enough resources.
متن کاملApplication of Recursive Least Squares to Efficient Blunder Detection in Linear Models
In many geodetic applications a large number of observations are being measured to estimate the unknown parameters. The unbiasedness property of the estimated parameters is only ensured if there is no bias (e.g. systematic effect) or falsifying observations, which are also known as outliers. One of the most important steps towards obtaining a coherent analysis for the parameter estimation is th...
متن کاملAn Efficient Algorithm for 2D Euclidean 2-Center with Outliers
For a set P of n points in R, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P . We extend this to the (2, k)-center problem where we compute the minimal radius pair of congruent disks to cover n − k points of P . We present a randomized algorithm with O(nk log n) expected running time for the (2, k)-center problem. We also study the (p, k)-ce...
متن کامل